On decomposability in logical calculi
نویسنده
چکیده
In the paper, a natural class of logical calculi is fixed for which we formulate the notion of a ∆–decomposable set of formulas. We demonstrate that the property of uniqueness of signature decompositions holds in those calculi of this class that have the Craig interpolation property. In conclusion, we give a sufficient condition for the ∆–decomposability property to be decidable.
منابع مشابه
SemanticWeb Basics in Logical Consideration
In this paper we study the operation of incremental data extraction from declarative knowledge bases and the problem of decomposability of data in such KBs, by viewing them as first-order logical theories. The operation of incremental data extraction is closely connected with query reformulation in information retrieval and data integration, while the decomposability problem is important in the...
متن کاملThe Algorithmic Complexity of Decomposability in Fragments of First-Order Logic
The research on applied logic in the mid 2000s has brought important methodological and algorithmic results on modularization of finitely axiomatizable logical theories. In particular, the research has been focused on the question whether logical theories have an inherent modular structure which could allow one to identify, in some sense, independent “components” in theories and use them as bui...
متن کاملConstructive Data Reenement in Typed Lambda Calculus
A new treatment of data reenement in typed lambda calculus is proposed, based on pre-logical relations HS99] rather than logical relations as in Ten94], and incorporating a constructive element. Constructive data reenement is shown to have desirable properties, and a substantial example of reenement is presented.
متن کاملA Framework for Defining Logical Frameworks ? dedicated to Gordon D . Plotkin , on the occasion of his 60 th birthday
In this paper, we introduce aGeneral Logical Framework, calledGLF, for defining Logical Frameworks, based on dependent types, in the style of the well known Edinburgh Logical Framework LF. The framework GLF features a generalized form of lambda abstraction where β-reductions fire provided the argument satisfies a logical predicate and may produce an n-ary substitution. The type system keeps tra...
متن کاملComplement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کامل